A simple proof of Zariski's Lemma
نویسنده
چکیده مقاله:
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
منابع مشابه
A simple proof of the Isolation Lemma
We give a new simple proof for the Isolation Lemma, with slightly better parameters, that also gives non-trivial results even when the weight domain m is smaller than the number of variables n. 1 The lemma and its proof Let n,m be two natural numbers, F ⊆ P([n]), where [n] = {1, . . . , n} and P([n]) is the set of all subsets of [n]. A weight function is a function w : [n] → [m]. Given a weight...
متن کاملA simple proof of Heymann's lemma
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملThe Retiming Lemma: A simple proof and applications
We present a new proof of the Retiming Lemma, which was rst formulated and proved by Leiserson and Saxe LS81]. Our proof relies on space-time transformations, and shows how retiming can be interpreted in the domain of space-time transformations. Two applications of the Retiming Lemma are given: one for designing circuits and the other for testing circuits.
متن کاملSimple proof of the detectability lemma and spectral gap amplification
The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a product of local projectors. We provide a simpler proof for the detectability lemma which applies to an arbitrary ordering of the local projector...
متن کاملProof of Lemma
Let E be a measurable set in R such that 0 < |E| < ∞. We will say that E tiles R by translations if there is a discrete set T ⊂ R such that, up to sets of measure 0, the sets E + t : t ∈ T are mutually disjoint and ⋃ t∈T (E + t) = R . We call any such T a translation set for E, and write that E + T = R is a tiling. It is known [19], [18] that if a convex set E tiles R by translations, it must b...
متن کاملB Proof of Theorem 4 a Proof of Lemma 9
At most B 0 nodes of T are at distance 1, at most B 0 +1 2 B 0 at distance 2, and B 0 +1 2 i?1 B 0 at distance i. Thus at least 2(? m)B 0 nodes are at distance greater than h. Using this observation, a straightforward calculation shows that C T is the minimum cost of any packing. Moreover, there may be no nodes at distance greater than h + 1. If any v a were at distance > h, then since v a 's r...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 43 شماره 5
صفحات 1529- 1530
تاریخ انتشار 2017-10-31
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023